Advances in Machine Learning I Dedicated to the Memory of Professor Ryszard S. Michalski

Advances in Machine Learning II


Advances in Intelligent Information Systems
In this paper we deal with the verb valency lexicon of Czech verbs named VerbaLex, which contains complex valency verb frames (CVFs) including both surface and deep valencies. The most notable features of CVFs include two-level semantic labels with linkage to the Princeton and EuroWordNet Top Ontology hierarchy and the corresponding surface verb frame patterns capturing the morphological cases that are typical of the highly inflected languages like Czech. We discuss the assumption that CVFs are suitable for a description of the predicate-argument structure not only of Czech verbs but also verbs in other languages, particularly Bulgarian, Romanian and English. We come to the conclusion that this hypothesis can be verified reliably enough exploiting the principle of translatability and also indirectly using semantic classes of (Czech) verbs.



Action rules and meta%2Dactions.

From Tinnitus Data to Action Rules and Tinnitus Treatment.

Association Action Rules and Action Paths Triggered by Meta%2Dactions.

Blind Music Timbre Source Isolation by Multi%2D resolution Comparison of Spectrum Signatures.

Multiple Classifiers for Different Features in Timbre Estimation.

Identification of Musical Instruments by Features Describing Sound Changes in Time.

Cascade Classifiers for Hierarchical Decision Systems.

Clustering Driven Cascade Classifiers for Multi%2Dindexing of Polyphonic Music by Instruments.

Emotion Based MIDI Files Retrieval System.

How to Support Consensus Reaching Using Action Rules a Novel Approach.

Action rule discovery from incomplete data.

Mining Complex Data
In recent years, the complexity of data objects in data mining applications has increased as well as their plain numbers. As a result, there exist various feature transformations and thus multiple object representations. For example, an image can be described by a text annotation, a color histogram and some texture features. To cluster these multi-represented objects, dedicated data mining algorithms have been shown to achieve improved results. In this paper, we will therefore introduce a method for hierarchical density-based clustering of multi-represented objects which is insensitive w.r.t. the choice of parameters. Furthermore, we will introduce a theoretical model that allows us to draw conclusions about the interaction of representations. Additionally, we will show how these conclusions can be used for defining a suitable combination method for multiple representations. To back up the usability of our proposed method, we present encouraging results for clustering a real world image data set that is described by 4 different representations.
Advances in Information and Intelligent Systems

Foundations of Intelligent Systems
The aim of this paper is to introduce the theoretical foundations of an approach for intelligent systems development. Derived from semiotics, a classic discipline in human sciences, the theory developed provides a mathematical framework for the concept of knowledge and for knowledge processing. As a result, a new perspective to study and to develop intelligent systems emerges. A taxonomy of elementary types of knowledge is proposed based on the classification of types of signs in semiotics, followed by a another classification of knowledge from the point of view of application in cognitive systems. In addition, we propose the mathematical definition of objects, objects systems and objects networks, to model mathematically the different types of knowledge described. The symbiosis of such key concepts introduces a computational paradigm to develop and implement intelligent systems, called here computational semiotics. 
On Reaching Consensus by a Group of Collaborating Agents.

Action Rules in Consensus Reaching Process Support.

Detecting Emotions in Classical Music from MIDI Files.

Action Rules Discovery Based on Tree Classifiers and Meta%2Dactions.

Polyphonic Music Information Retrieval Based on Multi%2Dlabel Cascade Classification System.

Music Instrument Estimation in Polyphonic Sound Based on Short%2DTerm Spectrum Match.

Tree%2DBased Algorithms for Action Rules Discovery.

Mining Complex Data
In recent years, the complexity of data objects in data mining applications has increased as well as their plain numbers. As a result, there exist various feature transformations and thus multiple object representations. For example, an image can be described by a text annotation, a color histogram and some texture features. To cluster these multi-represented objects, dedicated data mining algorithms have been shown to achieve improved results. In this paper, we will therefore introduce a method for hierarchical density-based clustering of multi-represented objects which is insensitive w.r.t. the choice of parameters. Furthermore, we will introduce a theoretical model that allows us to draw conclusions about the interaction of representations. Additionally, we will show how these conclusions can be used for defining a suitable combination method for multiple representations. To back up the usability of our proposed method, we present encouraging results for clustering a real world image data set that is described by 4 different representations.
Foundations of Intelligent Systems
The aim of this paper is to introduce the theoretical foundations of an approach for intelligent systems development. Derived from semiotics, a classic discipline in human sciences, the theory developed provides a mathematical framework for the concept of knowledge and for knowledge processing. As a result, a new perspective to study and to develop intelligent systems emerges. A taxonomy of elementary types of knowledge is proposed based on the classification of types of signs in semiotics, followed by a another classification of knowledge from the point of view of application in cognitive systems. In addition, we propose the mathematical definition of objects, objects systems and objects networks, to model mathematically the different types of knowledge described. The symbiosis of such key concepts introduces a computational paradigm to develop and implement intelligent systems, called here computational semiotics. 
Association Action Rules.
We propose a framework for simple causal theories of action, and study the computational complexity in it of various reasoning tasks such as determinism, progression and regression under various assumptions. As it turned out, even the simplest one among them, one-step temporal projection with complete initial state, is intractable. We also briefly consider an extension of the framework to allow truly indeterministic actions, and find that this extension does not increase the complexity of any of the tasks considered here. 1
Harmonic Blind Sound Source Isolation Enhanced by Spectrum Clustering.

Reclassification Rules.
Ontology mapping is the process whereby two ontologies are semantically related at conceptual level and the source ontology instances are transformed into target ontology entities according to those semantic relations. Ontology mapping faces new challenges in the context of Semantic Web, especially concerning heterogeneity, dynamics, distribution and limitations on representation technology. This paper introduces a new methodology and transformation process based on the notion of Service, which represents system transformation capabilities. MAFRA Toolkit is a specific implementation of MAFRA-Mapping FRAmework, where these new methodology and transformation process are being validated. MAFRA Toolkit is being applied in the European project Harmonise, which aims to provide solutions for (semi-) automatic interoperability between major operators in tourism e-business. MAFRA plays a major role in the specification, representation and reconciliation phases of the semantic mapping within the scope of the Harmonise technology. 1.
Action Rule Extraction from a Decision Table ARED.

Discovering the Concise Set of Actionable Patterns.

Mining Scalar Representations in a Non%2Dtagged Music Database.

Action Rules Discovery without Pre%2Dexisting Classification Rules.

Hierarchical Tree for Dissemination of Polyphonic Noise.

Multi%2Dgranularity Classification Rule Discovery Using ERID.

E%2DAction Rules.

Training of Classifiers for the Recognition of Musical Instrument Dominating in the Same%2DPitch Mix.%2
Automatic musical genre classification is an important tool for organizing the large collections of music that are becoming available to the average user. In addition it provides a structured way of evaluating musical content features that doesn’t require extensive user studies. This paper provides a detailed comparative analysis of various factors affecting automatic classification performance such as choice of features and classifiers. Using recent machine learning techniques such as Support Vector Machines we improve on previously published results using identical data collections and features. 1.
Mining E%2DAction Rules%2C System DEAR.

Training of Classifiers for the Recognition of Musical Instrument Dominating in the Same%2DPitch Mix.%2
Automatic musical genre classification is an important tool for organizing the large collections of music that are becoming available to the average user. In addition it provides a structured way of evaluating musical content features that doesn’t require extensive user studies. This paper provides a detailed comparative analysis of various factors affecting automatic classification performance such as choice of features and classifiers. Using recent machine learning techniques such as Support Vector Machines we improve on previously published results using identical data collections and features. 1.
From Mining Tinnitus Database to Tinnitus Decision%2DSupport System

Discriminant Feature Analysis for Music Timbre Recognition and Automatic Indexing.

ARAS Action Rules Discovery Based on Agglomerative Strategy.

Analysis of Sound Features for Music Timbre Recognition.

Protection of Sensitive Data based on Reducts in a Distributed Knowledge Discovery System.

Maximum Likelihood Study for Sound Pattern Separation and Recognition.
The increasing needs of content-based automatic indexing for large musical repositories have led to extensive investigation in musical sound pattern recognition. Numerous acoustical sound features have been developed to describe the characteristics of a sound piece. Many of these features have been successfully applied to monophonic sound timbre recognition. However, most of those features failed to describe enough characteristics of polyphonic sounds for the purpose of classification, where sound patterns from different sources are overlapping with each other. Thus, sound separation technique is needed to process polyphonic sounds into monophonic sounds before feature extraction. In this paper, we proposed a novel sound source separation and estimation system to isolate sound sources by maximum likelihood fundamental frequency estimation and pattern matching of a harmonic sequence in our feature database. 1.
Rules for Processing and Manipulating Scalar Music Theory.
The paper presents the application of classification rules and action rules to scalar music theory, with intent to: (1) describe certain facts in scalar music theory using classification rules and use them to build a system for automatic indexing of music by scale, region, genre, and emotion, (2) use action rules mining to create solutions (automatically generated hints) that permit developers to manipulate a composition by retaining the music score while simultaneously varying emotions it invokes. 1.
Multi%2Dway Hierarchic Classification of Musical Instrument Sounds.
Musical instrument sounds can be classified in various ways, depending on the instrument or articulation classification. This paper reviews a number of possible generalizations of musical instruments sounds classification which can be used to construct different hierarchical decision attributes. Each decision attribute will lead us to a new classifier and the same to a different system for automatic indexing of music by instrument sounds and their generalizations. Values of a decision attribute and their generalizations are used to construct atomic queries of a query language built for retrieving musical objects from MIR Database (see
MIRAI Multi%2Dhierarchical%2C FS%2DTree Based Music Information Retrieval System.
Abstract. With the fast booming of online music repositories, there is a need for content-based automatic indexing which will help users to find their favorite music objects in real time. Recently, numerous successful approaches on musical data feature extraction and selection have been proposed for instrument recognition in monophonic sounds. Unfortunately, none of these methods can be successfully applied to polyphonic sounds. Identification of music instruments in polyphonic sounds is still difficult and challenging, especially when harmonic partials are overlapping with each other. This has stimulated the research on music sound separation and new features development for content-based automatic music information retrieval. Our goal is to build a cooperative query answering system (QAS), for a musical database, retrieving from it all objects satisfying queries like ”find all musical pieces in pentatonic scale with a viola and piano where viola is playing for minimum 20 seconds and piano for minimum 10 seconds”. We use the database of musical sounds, containing almost 4000 sounds taken from the MUMs (McGill University Master Samples), as a vehicle to construct several classifiers for automatic instrument recognition. Classifiers showing the best performance are adopted for automatic indexing of musical pieces by instruments. Our musical database has an FS-tree (Frame Segment Tree) structure representation. The cooperativeness of QAS is driven by several hierarchical structures used for classifying musical instruments. 1
Constraint Based Action Rule Discovery with Single Classification Rules.

Knowledge discovery%2Dbased identification of musical pitches and instruments in polyphonic sounds.

Data Confidentiality Versus Chase.

Knowledge discovery%2Dbased identification of musical pitches and instruments in polyphonic sounds.

Sound Isolation by Harmonic Peak Partition For Music Instrument Recognition.

Foundations of Intelligent Systems
The aim of this paper is to introduce the theoretical foundations of an approach for intelligent systems development. Derived from semiotics, a classic discipline in human sciences, the theory developed provides a mathematical framework for the concept of knowledge and for knowledge processing. As a result, a new perspective to study and to develop intelligent systems emerges. A taxonomy of elementary types of knowledge is proposed based on the classification of types of signs in semiotics, followed by a another classification of knowledge from the point of view of application in cognitive systems. In addition, we propose the mathematical definition of objects, objects systems and objects networks, to model mathematically the different types of knowledge described. The symbiosis of such key concepts introduces a computational paradigm to develop and implement intelligent systems, called here computational semiotics. 
Cooperative Discovery of Interesting Action Rules.

Discovering e%2Daction rules from incomplete information systems.

Differentiated harmonic feature analysis on music information retrieval for instrument recognition.
Abstract—There are lots of different music recommendation systems to help users to get relevant items among the enormous amount of digital music items on all different purposes. The quality of a recommendation system is critically based on what the system can understand about the music objects. This has stimulated the research on automatic music information retrieval. Numerous approaches have been proposed for instrument recognition in terms of feature extraction and selection. Moving Picture Experts Group (MPEG) standardized a set of features based on the digital audio content data for the purpose of interpretation of the information meaning. Features investigated so far are intended to describe a frame window, the whole sound segment, or arbitrarily split bins of the sound segment. Sound vibration in the transient state is known to be significantly different from the one in the quasi-steady state, while information in the transient state is important for instrument recognition by human. However, the boundary of the transient state and feature behaviors in the transient state has been barely investigated. We proposed a differentiated analysis to harmonic features with transient duration boundary detection by instantaneous fundamental frequency in each frame.
Blind Signal Separation of Similar Pitches and Instruments in a Noisy Polyphonic Domain.
Abstract. In our continuing work on ”Blind Signal Separation ” this paper focuses on extending our previous work [1] by creating a data set that can successfully perform blind separation of polyphonic signals containing similar instruments playing similar notes in a noisy environment. Upon isolating and subtracting the dominant signal from a base signal containing varying types and amounts of noise, even though we purposefully excluded any identical matches in the dataset, the signal separation system successfully built a resulting foreign set of synthesized sounds that the classifier correctly recognized. Herein, this paper presents a system that classifies and separates two harmonic signals with added noise. This novel methodology incorporates Knowledge Discovery, MPEG7-based segmentation and Inverse Fourier Transforms. 1
Action Rules Discovery%2C a New Simplified Strategy.
A new strategy for discovering action rules (or interventions) is presented in this paper. The current methods [14], [12], [8] require to discover classification rules before any action rule can be constructed from them. Several definitions of action rules [8], [13], [9], [3] have been proposed. They differ in the generality of their classification parts but they are always constructed from certain pairs of classification rules. Our new strategy defines the classification part of an action rule in a unique way. Also, action rules are constructed from single classification rules. We show how to compute their confidence and support. Action rules are used to reclassify objects. In this paper, we propose a method for measuring the level of reclassification freedom for objects in a decision system. 
Action Rules Discovery System DEAR%5F3.

Extracting Rules from Incomplete Decision Systems System ERID.

Solving Failing Queries through Cooperation and Collaboration.
Sometime Query Answering Systems (QAS) for a Distributed Autonomous Information System (DAIS) may fail by returning the empty set of objects as an answer for a query q. Systems in DAIS can be incomplete, have hierarchical attributes, and the semantics of attributes and their values may differ between sites. Also, if there are no objects in S matching q, the query may fail when submitted to S. Alternatively, QAS for S may try to relax the query q as it was proposed in [8], [9], and [2]. It means that q can be replaced by a new more general query. Clearly, the goal is to find possibly the smallest generalization of q which will not fail in S. Smaller generalizations guarantee higher confidence in objects returned by QAS. Such QAS is called cooperative (only one site is involved). Queries may also fail in S when some of the attributes listed in q are outside the domain of S. To resolve this type of queries, assuming that S is a part of DAIS, we may extract definitions of such attributes from information systems residing at some of the remote sites for S and next used them to approximate q in S. In order to do that successfully, we assume that all involved systems have to agree on the ontology of some of their common attributes [15], [16], [17]. QAS based on the above strategy is called collaborative (minimum two sites are involved). Similarly, a query may fail in S when the granularity of an attribute used in q is finer than the granularity of the same attribute in S. This paper shows how to use collaboration and cooperation approach to solve failing queries in DAIS assuming that attributes are hierarchical. Some aspects of a collaboration strategy dealing with failing query problem for non-hierarchical attributes have been presented in [15], [16]. 
Foundations of Intelligent Systems
The aim of this paper is to introduce the theoretical foundations of an approach for intelligent systems development. Derived from semiotics, a classic discipline in human sciences, the theory developed provides a mathematical framework for the concept of knowledge and for knowledge processing. As a result, a new perspective to study and to develop intelligent systems emerges. A taxonomy of elementary types of knowledge is proposed based on the classification of types of signs in semiotics, followed by a another classification of knowledge from the point of view of application in cognitive systems. In addition, we propose the mathematical definition of objects, objects systems and objects networks, to model mathematically the different types of knowledge described. The symbiosis of such key concepts introduces a computational paradigm to develop and implement intelligent systems, called here computational semiotics. 
Mining for Interesting Action Rules.

Failing Queries in Distributed Autonomous Information System.

Extracting Emotions from Music Data.
Abstract. Music is not only a set of sounds, it evokes emotions, subjectively perceived by listeners. The growing amount of audio data available on CDs and in the Internet wakes up a need for content-based searching through these files. The user may be interested in finding pieces in a specific mood. The goal of this paper is to elaborate tools for such a search. A method for the appropriate objective description (parameterization) of audio files is proposed, and experiments on a set of music pieces are described. The results are summarized in concluding chapter. 1
Extracting Emotions from Music Data.
Abstract. Music is not only a set of sounds, it evokes emotions, subjectively perceived by listeners. The growing amount of audio data available on CDs and in the Internet wakes up a need for content-based searching through these files. The user may be interested in finding pieces in a specific mood. The goal of this paper is to elaborate tools for such a search. A method for the appropriate objective description (parameterization) of audio files is proposed, and experiments on a set of music pieces are described. The results are summarized in concluding chapter. 1


Innertron New Methodology of Facial Recognition%2C Part I.

Innertron New Methodology of Facial Recognition%2C Part II.

Knowledge Discovery Based Query Answering in Hierarchical Information Systems.
The paper concerns failing queries in incomplete Distributed Autonomous Information Systems (DAIS) based on attributes which are hierarchical and which semantics at different sites of DAIS may differ. Query q fails in an information system S, if the empty set of objects is returned as an answer. Alternatively, query q can be converted to a new query which is solvable in S. By a refinement of q, we mean a process of replacing q by a new relaxed query, as it was proposed in [2], [7], and [8], which is similar to q and which does not fail in S. If some attributes listed in q have values finer than the values used in S, then rules discovered either locally at S or at other sites of DAIS are used to assign new finer values of these attributes to objects in S. Queries may also fail in S when some of the attributes listed in q are outside the domain of S. To resolve this type of a problem, we extract definitions of such attributes at some of the remote sites for S in DAIS and next use them to approximate q in S. In order to do that successfully, we assume that all involved information systems have to agree on the ontology of some of their common attributes [14], [15], [16]. This paper shows that failing queries can be often handled successfully if knowledge discovery methods are used either to convert them to new queries or to find finer descriptions of objects in S. 
Ensuring Data Security Against Knowledge Discovery in Distributed Information Systems.

Preface to special issue on knowledge discovery Dedicated to Jan M. Zytkow.

Action rules mining.

Knowledge discovery dedicated to Jan M. Zytkow.

Action rules discovery system DEAR2%2C method and experiments.

Query Answering Based on Collaboration and Chase.

Do We Need Automatic Indexing of Musical Instruments%3F.

Tree%2Dbased Algorithm for Discovering Extended Action%2DRules %28System DEAR2%29.

Rule Discovery by Axes%2DDriven Hyperplanes Construction.

Ontology%2Dbased distributed autonomous knowledge systems.
Traditional query processing usually requires that users fully understand the database structure and content to issue a query. Due to the complexity of the database applications and the variety of user needs, the so called global queries are introduced which traditional query answering systems can not handle. Query posed to a database D isgl3 al if minimum one of its attributes is missing in D whil it occurs in other databases. Definitions of a missing attribute in D can be extracted from other databases and shared with D. To handle semantics inconsistencies between the same attributes used at different sites, task ontol][4[ are used as a communication bridge between them. These inconsistencies can be caused either by different granulP ityl3 el or by different interpretations of the same attribute. As the final outcome of this research, a rough query answering system based on distributed data mining is presented.
Foundations of Intelligent Systems
The aim of this paper is to introduce the theoretical foundations of an approach for intelligent systems development. Derived from semiotics, a classic discipline in human sciences, the theory developed provides a mathematical framework for the concept of knowledge and for knowledge processing. As a result, a new perspective to study and to develop intelligent systems emerges. A taxonomy of elementary types of knowledge is proposed based on the classification of types of signs in semiotics, followed by a another classification of knowledge from the point of view of application in cognitive systems. In addition, we propose the mathematical definition of objects, objects systems and objects networks, to model mathematically the different types of knowledge described. The symbiosis of such key concepts introduces a computational paradigm to develop and implement intelligent systems, called here computational semiotics. 
CHASE2 %2D Rule Based Chase Algorithm for Information Systems of Type lambda.

Discovering Non%2DStandard Semantics of Semi%2DStable Attributes.

Discovering Extended Action%2DRules %28System DEAR%29.

Discovering Semantic Inconsistencies to Improve Action Rules Mining.

Representing Audio Data by FS%2DTrees and Adaptable TV%2DTrees.

The Wisdom Web New Challenges for Web Intelligence %28WI%29.

Handling Semantic Inconsistencies in Distributed Knowledge Systems Using Ontologies.

Editorial Music Information Retrieval.

Foundations of Intelligent Systems
The aim of this paper is to introduce the theoretical foundations of an approach for intelligent systems development. Derived from semiotics, a classic discipline in human sciences, the theory developed provides a mathematical framework for the concept of knowledge and for knowledge processing. As a result, a new perspective to study and to develop intelligent systems emerges. A taxonomy of elementary types of knowledge is proposed based on the classification of types of signs in semiotics, followed by a another classification of knowledge from the point of view of application in cognitive systems. In addition, we propose the mathematical definition of objects, objects systems and objects networks, to model mathematically the different types of knowledge described. The symbiosis of such key concepts introduces a computational paradigm to develop and implement intelligent systems, called here computational semiotics. 
Handling Semantic Inconsistencies in Distributed Knowledge Systems Using Ontologies.



Collaborative Query Processing in DKS Controlled by Reducts.

Global Action Rules in Distributed Knowledge Systems.

Handling Semantic Inconsistencies in Query Answering Based on Distributed Knowledge Mining.

Reducts%2Ddriven query answering for distributed autonomous knowledge systems.

The Role of Support and Confidence in Collaborative Query Answering.

Audio Content Description in Sound Databases.

Query Answering in DAKS Based on Reducts.

Foundations and Discovery of Operational Definitions.
Empirical equations and rules are important classes of regularities that can be discovered in databases. We concentrate on their role as definitions of attribute values. Such definitions can be used in many ways in a single database and for transfer of knowledge between databases. We analyze quests for definitions of an attribute in a given database. A quest triggers a discovery mechanism that specializes in searching recursively a system of databases and returns a set of partial definitions. We introduce the notion of shared operational semantics founded on an equation-based and rule-based system of partial de nitions. It gives necessary foundations for designing local query answering systems in a distributed knowledge system (DKS). 
Mining for Action%2DRules in Large Decision Tables Classifying Customers.

Action%2DRules How to Increase Profit of a Company.

Mining for Attribute Definitions in a Distributed Two%2DLayered DB System.

Introduction.
The use of monads to structure functional programs is described. Monads provide a convenient framework for simulating e ects found in other languages, such as global state, exception handling, output, or non-determinism. Three case studies are looked at in detail: how monads ease the modi cation of a simple evaluator; how monads act as the basis of a datatype of arrays subject to in-place update; and how monads can be used to build parsers.  
Foundations of Intelligent Systems
The aim of this paper is to introduce the theoretical foundations of an approach for intelligent systems development. Derived from semiotics, a classic discipline in human sciences, the theory developed provides a mathematical framework for the concept of knowledge and for knowledge processing. As a result, a new perspective to study and to develop intelligent systems emerges. A taxonomy of elementary types of knowledge is proposed based on the classification of types of signs in semiotics, followed by a another classification of knowledge from the point of view of application in cognitive systems. In addition, we propose the mathematical definition of objects, objects systems and objects networks, to model mathematically the different types of knowledge described. The symbiosis of such key concepts introduces a computational paradigm to develop and implement intelligent systems, called here computational semiotics. 
Discovery of Equations and the Shared Operational Semantics in Distributed Autonomous Databases.

Discovering Rules in Information Trees.

Knowledge Discovery Objects and Queries in Distributed Knowledge Systems.
The development of many knowledge discovery methods (see [14], [7], [16]) provided us with good foundations to build a kd-Query Answering System (kdQAS) for Distributed Knowledge Systems (DKS). By DKS we mean a number of autonomous processing elements (called knowledge systems) that are interconnected by a computer network and that cooperate in their assigned tasks. A knowledge-system we see as a relational database coupled with a discovery layer which is simplified in this paper to a set of rules. Queries
Handling Queries in Incomplete CKBS through Knowledge Discovery.

Foundations of Intelligent Systems
The aim of this paper is to introduce the theoretical foundations of an approach for intelligent systems development. Derived from semiotics, a classic discipline in human sciences, the theory developed provides a mathematical framework for the concept of knowledge and for knowledge processing. As a result, a new perspective to study and to develop intelligent systems emerges. A taxonomy of elementary types of knowledge is proposed based on the classification of types of signs in semiotics, followed by a another classification of knowledge from the point of view of application in cognitive systems. In addition, we propose the mathematical definition of objects, objects systems and objects networks, to model mathematically the different types of knowledge described. The symbiosis of such key concepts introduces a computational paradigm to develop and implement intelligent systems, called here computational semiotics. 
Query Approximate Answering System for an Incomplete DKBS.

Collaboration Control in Distributed Knowledge%2DBased Systems.
A distributed knowledge-based system (DKBS) is a collection of autonomous knowledge-based systems called agents. We assume here that these agents are capable of interacting with each other. They work together in solving queries submitted to DKBS according to their respective abilities. Each agent is represented by an information system (collection of data) and a dictionary (collection of rules). In [10], we proposed that an agent of DKBS can request from other agents rough descriptions of all unknown attribute values used in a query submitted to him. Some of these descriptions do not have to be consistent because they are created independently by different agents. The problem of repairing such descriptions (see [15]) requires additional interaction between all involved agents. Communication control between them is necessary.
Foundations of Intelligent Systems
The aim of this paper is to introduce the theoretical foundations of an approach for intelligent systems development. Derived from semiotics, a classic discipline in human sciences, the theory developed provides a mathematical framework for the concept of knowledge and for knowledge processing. As a result, a new perspective to study and to develop intelligent systems emerges. A taxonomy of elementary types of knowledge is proposed based on the classification of types of signs in semiotics, followed by a another classification of knowledge from the point of view of application in cognitive systems. In addition, we propose the mathematical definition of objects, objects systems and objects networks, to model mathematically the different types of knowledge described. The symbiosis of such key concepts introduces a computational paradigm to develop and implement intelligent systems, called here computational semiotics. 
Methodologies for Intelligent Systems

Guest Editors%27 Preface %2D Selected Papers from the ISMIS%2793 Symposium.

Methodologies for Intelligent Systems

Methodologies for Intelligent Systems

A Model of Information Sharing for Fault%2DTolerant Flexible Manufacturing Systems.

Query processing in distributed information systems.
Abstract—This paper addresses the problem of evaluating ranked top-k queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries, we believe such support for ranked queries will be even more important: First, ranked queries often need to model user-specific concepts of preference, relevance, or similarity, which call for dynamic user-defined functions. Second, middleware systems must incorporate external predicates for integrating autonomous sources typically accessible only by per-object queries. Third, ranked queries often accompany Boolean ranking conditions, which may turn predicates into expensive ones, as the index structure on the predicate built on the base table may be no longer effective in retrieving the filtered objects in order. Fourth, fuzzy joins are inherently expensive, as they are essentially user-defined operations that dynamically associate multiple relations. These predicates, being dynamically defined or externally accessed, cannot rely on index mechanisms to provide zero-time sorted output, and must instead require per-object probe to evaluate. To enable probe minimization, we develop the problem as cost-based optimization of searching over potential probe schedules. In particular, we decouple probe scheduling into object and predicate scheduling problems and develop an analytical object scheduling optimization and a dynamic predicate scheduling optimization, which combined together form a cost-effective probe schedule. Index Terms—Database query processing, distributed information systems, database systems. 1
Fault%2DRecovery and Intelligent Distributed System.

Imprecise Concept Learning within a Growing Language.

Learning Driven by the Concepts Structure.

Learning Machine for Probabilistically Describable Concepts.

On Learning with Imperfect Teachers.
. We introduce a new fault-tolerant model of algorithmic learning using an equivalence oracle and an incomplete membership oracle, in which the answers to a random subset of the learner&#039;s membership queries may be missing. We demonstrate that, with high probability, it is still possible to learn monotone DNF formulas in polynomial time, provided that the fraction of missing answers is bounded by some constant less than one. Even when half the membership queries are expected to yield no information, our algorithm will exactly identify m-term, n-variable monotone DNF formulas with an expected O(mn  2  ) queries. The same task has been shown to require exponential time using equivalence queries alone. We extend the algorithm to handle some one-sided errors, and discuss several other possible error models. It is hoped that this work may lead to a better understanding of the power of membership queries and the effects of faulty teachers on query models of concept learning.  Keywords: concep...
Learning in Rough Environment%2C an Optimization Procedure.

Learning in Knowledge Based System%2C a Possibilistic Approach.

Information retrieval systems%2C an algebraic approach I.

Information retrieval systems%2C an algebraic approach II.

On Information Storage and Retrieval Systems An Algebraic Approach%2C Part I.

On a Relationship Between Programs of Address Machines and Mazurkiewicz Algorithms.

Classification of Programs of a SPC.

